منابع مشابه
Bold Graph Drawings
When a graph is drawn in a classical manner, its vertices are shown as small disks and its edges with a positive width; zero-width edges exist only in theory. Let r denote the radius of the disks that show vertices and w the width of edges. We give a list of conditions that make such a drawing good and that apply to not necessarily planar graphs. We show that if r < w, a vertex must have consta...
متن کاملMorphing Planar Graph Drawings
The study of planar graphs dates back to Euler and the earliest days of graph theory. Centuries later came the proofs by Wagner, Fáry and Stein that every planar graph can be drawn with straight line segments for the edges, and the algorithm by Tutte for constructing such straight-line drawings given in his 1963 paper, “How to Draw a Graph”. With more recent attention to complexity issues, this...
متن کاملReally Straight Graph Drawings
We study straight-line drawings of graphs with few segments and few slopes. Optimal results are obtained for all trees. Tight bounds are obtained for outerplanar graphs, 2-trees, and planar 3-trees. We prove that every 3-connected plane graph on n vertices has a plane drawing with at most 5n/2 segments and at most 2n slopes, and that every cubic 3-connected plane graph has a plane drawing with ...
متن کاملRefinement of Orthogonal Graph Drawings
Current orthogonal graph drawing algorithms produce drawings which are generally good. However, many times the readability of orthogonal drawings can be signiicantly improved with a postprocess-ing technique, called reenement, which improves aesthetic qualities of a drawing such as area, bends, crossings, and total edge length. Reene-ment is separate from layout and works by analyzing and then ...
متن کاملDistinct Distances in Graph Drawings
The distance-number of a graph G is the minimum number of distinct edgelengths over all straight-line drawings of G in the plane. This definition generalises many well-known concepts in combinatorial geometry. We consider the distancenumber of trees, graphs with no K− 4 -minor, complete bipartite graphs, complete graphs, and cartesian products. Our main results concern the distance-number of gr...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Computational Geometry
سال: 2011
ISSN: 0925-7721
DOI: 10.1016/j.comgeo.2011.06.002